Theorem Proving for Verification
نویسنده
چکیده
The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملFrom Refutation to Verification
Model checking has won some industrial acceptance in debugging designs. Theorem proving and formal verification are less popular. An approach built around automated abstractions could integrate theorem proving with model checking in an acceptable way and provide a bridge between refutation and verification.
متن کاملOn Explicit Reflection in Theorem Proving and Formal Verification
The basic properties of soundness, extensibility, and stability required from a verification system V taken in full yield the necessity of having a reflection rule in every such V. However, the reflection rule based on the Gödel provability predicate (implicit provability predicate) leads to a "reflection tower" of theories which cannot be formally verified. The paper introduces an explicit ref...
متن کاملCrowdsourcing Theorem Proving via Natural Games
Despite the science of modern formal reasoning being more than a century old, mechanized formal reasoning is nowhere near what expert human reasoners (formal and informal) can achieve. Meanwhile, there is a steadily increasing need for automated theorem proving in various fields of science and engineering. Proof discovery and verification in science and mathematics [2,3,4,5], formal verificatio...
متن کاملApplication Specific Higher Order Logic Theorem Proving
Theorem proving allows the formal verification of the correctness of very large systems. In order to increase the acceptance of theorem proving systems during the design process, we implemented higher order logic proof systems for ANSI-C and Verilog within a framework for application specific proof systems. Furthermore, we implement the language of the PVS theorem prover as well-established hig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000